Lazy Uniication with Simpliication
نویسنده
چکیده
Uniication in the presence of an equational theory is an important problem in theorem-proving and in the integration of functional and logic programming languages. This paper presents an improvement of the proposed lazy uniication methods by incorporating simpliication into the uniication process. Since simpliication is a deterministic computation process, more eecient uniication algorithms can be achieved. Moreover, simpliication reduces the search space so that in some case innnite search spaces are reduced to nite ones. We show soundness and completeness of our method for equational theories represented by ground connuent and terminating rewrite systems which is a reasonable class w.r.t. functional logic programming.
منابع مشابه
Combining Lazy Narrowing and Simplification
Languages that integrate functional and logic programming styles with a complete operational semantics are based on narrowing. In order to avoid useless computations and to deal with innnite data structures , lazy narrowing strategies have been proposed in the past. This paper presents an important improvement of lazy narrowing by incorporating deterministic simpliication steps into lazy narrow...
متن کاملLazy Linear Combinatorial Unification
In this paper we deene a two-rule reduction system for the lazy computation of uniication on rst-order terms. The computation consists of a sequence of reductions which is almost linear with the size of the input. Every reduction transforms the problem into an equivalent one which is a better approximation of the solution. The approach is based on a combinatorial system which provides abstracti...
متن کاملOverview of Existing Recurrent Schematizations
Innnite sets of objects with structural similarities appear frequently at diierent places in the theory of equational reasoning, automatic deduction, logic programming, and databases. The objects in such innnite families can have several forms. They are represented most frequently by terms. The formalisms to deal with innnite families are fairly limited. As long as only the representation is co...
متن کاملLazy Narrowing with Parametric Order Sorted Types
Recently, a model theoretic semantics for lazy functional programming combining parametric and inclusion polymorphism has been proposed in 2]. The aim of the present work is to provide the previous one with the incorporation of a typed lazy narrowing calculus for goal solving which combines lazy uniication, sharing and type checking at run-time. Furthermore, we state soundness and completeness ...
متن کاملExplicit Substitutions : The Case of Higher - Order PatternsGilles
Following the general method and related completeness results on using explicit substitutions to perform higher-order uniication proposed in 5], we investigate in this paper the case of higher-order patterns as introduced by Miller. We show that our general algorithm specializes in a very convenient way to patterns. We also sketch an eecient implementation of the abstract algorithm and its gene...
متن کامل